A Simple Binary Run-Length Compression Technique for Non-Binary Sources Based on Source Mapping
نویسندگان
چکیده
منابع مشابه
Binary Morphology and Related Operations on Run-Length Representations
Binary morphology on large images is compute intensive, in particular for large structuring elements. Run-length encoding is a compact and space-saving technique for representing images. This paper describes how to implement binary morphology directly on run-length encoded binary images for rectangular structuring elements. In addition, it describes efficient algorithm for transposing and rotat...
متن کاملBinary jumbled string matching for highly run-length compressible texts
The Binary Jumbled String Matching problem is defined as: Given a string s over {a, b} of length n and a query (x, y), with x, y non-negative integers, decide whether s has a substring t with exactly x a’s and y b’s. Previous solutions created an index of size O(n) in a pre-processing step, which was then used to answer queries in constant time. The fastest algorithms for construction of this i...
متن کاملFast and Simple Jumbled Indexing for Binary Run-Length Encoded Strings
Important papers have appeared recently on the problem of indexing binary strings for jumbled pattern matching, and further lowering the time bounds in terms of the input size would now be a breakthrough with broad implications. We can still make progress on the problem, however, by considering other natural parameters. Badkobeh et al. (IPL, 2013) and Amir et al. (TCS, 2016) gave algorithms tha...
متن کاملA new compression technique for binary text images
In this paper a new lossless binary text image coding technique based on overlapping partitioning is presented. In this technique, the black regions in the image are#rst partitioned into a number offully overlapping and nonoverlapping rectangles. A f e r partitioning, the two opposite vertices of each rectangle are compressed using a simple encoding technique. It has been demostrated that the c...
متن کاملA simple and robust scoring technique for binary classification
A new simple scoring technique is developed in a binary supervised classification context when only a few observations are available. It consists in two steps: in the first one partial scores are obtained, one for each predictor, either categorical or continuous. Each partial score is a discrete variable with 7 values ranging from -3 to 3, based upon an empirical comparison of the distributions...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Active and Passive Electronic Components
سال: 2001
ISSN: 0882-7516,1563-5031
DOI: 10.1155/2001/23505